On polynomial approximation of circular arcs and helices
نویسندگان
چکیده
منابع مشابه
Approximation of circular arcs by parametric polynomial curves
In this paper the approximation of circular arcs by parametric polynomial curves is studied. If the angular length of the circular arc is h, a parametric polynomial curve of arbitrary degree n ∈ N, which interpolates given arc at a particular point, can be constructed with radial distance bounded by h2n. This is a generalization of the result obtained by Lyche and Mørken for odd n.
متن کاملBasic Polynomial Inequalities on Intervals and Circular Arcs
We prove the right Lax-type inequality on subarcs of the unit circle of the complex plane for complex algebraic polynomials of degree n having no zeros in the open unit disk. This is done by establishing the right Bernstein-Szegő-Videnskii type inequality for real trigonometric polynomials of degree at most n on intervals shorter than the period. The paper is closely related to recent work by B...
متن کاملQuartic approximation of circular arcs using equioscillating error function
A high accuracy quartic approximation for circular arc is given in this article. The approximation is constructed so that the error function is of degree 8 with the least deviation from the x-axis; the error function equioscillates 9 times; the approximation order is 8. The numerical examples demonstrate the efficiency and simplicity of the approximation method as well as satisfying the propert...
متن کاملClosed Space Curves of Constant Curvature Consisting of Arcs of Circular Helices
A closed κ0-curve is a closed regular curve of class C r (r ≥ 2) in the Euclidean 3-space having constant curvature κ0 > 0. We present various examples of nonplanar closed κ0-curves of class C , which are composed of n arcs of circular helices. The construction of c starts from the spherical image (= tangent indicatrix) c of c, which then has to be a closed regular curve of class C on the unit ...
متن کاملTriangulations with Circular Arcs
An important objective in the choice of a triangulation is that the smallest angle becomes as large as possible. In the straight line case, it is known that the Delaunay triangulation is optimal in this respect. We propose and study the concept of a circular arc triangulation— a simple and effective alternative that offers flexibility for additionally enlarging small angles—and discuss its appl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Mathematics with Applications
سال: 2012
ISSN: 0898-1221
DOI: 10.1016/j.camwa.2011.12.036